An indefinite variant of LOBPCG for definite matrix pencils
نویسندگان
چکیده
منابع مشابه
Definite Matrix Polynomials and their Linearization by Definite Pencils
Hyperbolic matrix polynomials are an important class of Hermitian matrix poly-nomials that contain overdamped quadratics as a special case. They share with definite pencils the spectral property that their eigenvalues are real and semisimple. We extend the definition of hyperbolic matrix polynomial in a way that relaxes the requirement of definiteness of the leading coefficient matrix, yielding...
متن کاملAn Arithmetic for Matrix Pencils
We deene an algebra on matrix pencils that is a natural extension of sums, products and quotients of real numbers. The classical algebra of linear transformations may be regarded as a special case of the algebra of pencils. The sum and product deened here preserve right deeating subspaces. We show below that the matrix sign function and the inverse-free algorithms can be derived from an algebra...
متن کاملAn Arithmetic for Rectangular Matrix Pencils
This presentation is a generalization of 8] from square, regular n-by-n, pencils to singular and rectangular m-by-n pencils. We deene arithmetic-like operations on matrix pencils that are a natural extension of sums, products and quotients of real numbers. The algebra of linear transformations may be regarded as a special case of this pencil arithmetic. The language of linear relations leads to...
متن کاملAlgorithms for the Indefinite and Definite Summation
The celebrated Zeilberger algorithm which finds holonomic recurrence equations for definite sums of hypergeometric terms F (n, k) is extended to certain nonhypergeometric terms. An expression F (n, k) is called hypergeometric term if both F (n + 1, k)/F (n, k) and F (n, k+1)/F (n, k) are rational functions. Typical examples are ratios of products of exponentials, factorials, Γ function terms, b...
متن کاملMatrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint
We consider minimization of a quadratic objective function subject to a sign-indefinite quadratic equality constraint. We derive necessary and sufficient conditions for the existence of solutions to the constrained minimization problem. These conditions involve a generalized eigenvalue of the matrix pencil consisting of a symmetric positivesemidefinite matrix and a symmetric indefinite matrix. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2013
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-013-9754-3